A Multiobjective Optimisation Technique for Exam Timetabling Based on Trajectories
نویسندگان
چکیده
The most common approach to multiobjective examination timetabling is the weighted sum aggregation of all criteria into one cost function and application of some single-objective metaheuristic. However, the translation of user preferences into the weights of criteria is a sophisticated task, which requires experience on the part of the user, especially for problems with a high number of criteria. Moreover, the results produced by this technique are usually substantially scattered. Thus, the outcome of weighted sum algorithms is often far from user expectation. In this paper we suggest a more transparent method, which enables easier expression of user preferences. This method requires the user to specify a reference solution, which can be either produced manually or chosen among the set of solutions, generated by any automated method. Our aim is to improve the values of the reference objectives, i.e. to produce a solution which dominates the reference one. In order to achieve this, a trajectory is drawn from the origin to the reference point and a “Great Deluge” local search is conducted through the specified trajectory. During the search the weights of the criteria are dynamically changed. The proposed technique was experimentally tested on real-world exam timetabling problems on both bi-criteria and nine-criteria cases. All results obtained by the variable weights Great Deluge algorithm outperformed the ones published in the literature by all criteria.
منابع مشابه
A Multiobjective Optimisation Technique for Exam Timetabling Problems Based on the Defined Trajectory
University examination timetabling problems comprise arranging exams in the given number of timeslots through the examination sessions. The primary objective of this process is avoiding of students' clashes (i.e. no one student should take two exams simultaneously). This requirement is generally considered as a hard constraint and should be obligatory satisfied in a feasible timetable. However,...
متن کاملAn Introduction to Multiobjective Metaheuristics for Scheduling and Timetabling
In many real-world scheduling problems (eg. machine scheduling, educational timetabling, personnel scheduling, etc.) several criteria must be considered simultaneously when evaluating the quality of the solution or schedule. Among these criteria there are: length of the schedule, utilisation of resources, satisfaction of people’s preferences and compliance with regulations. Traditionally, these...
متن کاملAnalysing the High Level Heuristics within a Graph Based Hyper-heuristic
This paper presents our work on analysing high level heuristics within a graph based hyper-heuristic framework. Local search based methods (Tabu Search and steepest descent method) are compared as the high level heuristics within the graph based hyper-heuristic framework and the analysis of their neighborhood structures and performance on the high level landscape is carried out. An iterated ste...
متن کاملA hyperheuristic approach to examination timetabling problems: benchmarks and a new problem from practice
Many researchers studying examination timetabling problems focus on either benchmark problems or problems from practice encountered in their institutions. Hyperheuristics are proposed as generic optimisation methods which explore the search space of heuristics rather than direct solutions. In the present study, the performance of tournament-based hyperheuristics for the exam timetabling problem...
متن کاملMulti-Objective Aspects of the Examination Timetabling Competition Track (Abstract)
The examination timetabling problem has been extensively studied since Carter produced a collection of real instances [1] (for a recent survey see [2]). This year, a significant extension to the set of realistic instances has been provided by the examination timetabling track [3] of the 2007 International Timetabling Competition2. The exam track instances are much more realistic than the Carter...
متن کامل